The Multi-visits Drone-Vehicle Routing Problem with Simultaneous Pickup and Delivery Service

The development of convergent technology makes the drone expected to become a commercial delivery method for terminal logistics distribution. Although industry has begun experiment with coordinated transportation drones and vehicles, some limited assumptions have been made reduce complexity synchronization. This paper studies mathematical formulations efficient solution methodologies multi-visits drone-vehicle routing problem simultaneous pickup service (MDVRPSPD), whose objective is minimize distance traveled by vehicles total number used. To solve MDVRPSPD problem, three-stage designed. Firstly, scalable K-means++ algorithm used determine vehicle’s parking location, we optimize driving route traveling salesman (TSP) modeling; then, classic tabu search extended arrange schedule which consider service. Meanwhile, set extensive computational experiments are conducted demonstrate efficiency developed heuristics superiority system on issues.